N-Tuples in the Class A(N) and Factorization Properties
نویسندگان
چکیده
منابع مشابه
Orbits on n-tuples
A transitive (infinite) permutation group which has m orbits on ordered pairs of distinct points has at least mn−1 orbits on ordered n-tuples. This is best possible, and groups attaining the bound can be characterised.
متن کامل$n$-factorization Property of Bilinear Mappings
In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorization property of level $kappa$ for $X^*$ with respect to $f$ and automatically boundedness and $w^*$-$w^*$-continuity...
متن کاملidentifying the strategies persian efl learners use in reading an expository text in english and examining its relation to reading-proficiency and motivation: a think-aloud study
هدف اصلی از این مطالعه بررسی نوع و میزان استراتژی هایی بود که دانشجویان فارسی زبان رشته ی زبان انگلیسی در حین خواندن یک متن انگلیسی به کار گرفتند. این مطالعه همچنین به بررسی تفاوت های استراتژی های مورد استفاده بین دارندگان سطح بالا و پایین درک مطلب پرداخت. نوع همبستگی بین استراتژی به کار گرفته و درک مطلب از یک سو و استراتژی به کار گرفته و انگیزه از سوی دیگر نیز در این تحقیق مورد آزمایش قرار گرف...
15 صفحه اولdevelopment and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولPacking of graphic n-tuples
An n-tuple π (not necessarily monotone) is graphic if there is a simple graph G with vertex set {v1, . . . , vn} in which the degree of vi is the ith entry of π. Graphic n-tuples (d (1) 1 , . . . , d (1) n ) and (d (2) 1 , . . . , d (2) n ) pack if there are edge-disjoint n-vertex graphs G1 and G2 such that dG1(vi) = d (1) i and dG2(vi) = d (2) i for all i. We prove that graphic n-tuples π1 and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2002
ISSN: 0022-1236
DOI: 10.1006/jfan.2001.3813